A certified algorithm for the InCircle predicate among ellipses
نویسندگان
چکیده
This paper examines the InCircle predicate among ellipses in the Euclidean plane, under the exact computation paradigm. The ellipses are non-intersecting and given in parametric representation. We present a subdivision-based algorithm and implement it in Maple and CORE.
منابع مشابه
ACS Algorithms for Complex Shapes with Certified Numerics and Topology Algebraic tools for the Voronoi diagram of ellipses, leading to an experimental implementation
We study the four predicates required for the Voronoi diagram of ellipses in the plane, under the Euclidean metric, based on an incremental algorithm. The report concentrates on InCircle, which is the hardest predicate: it decides the position of a query ellipse relative to the Voronoi circle of three given ellipses. The implementation of InCircle combines a certified numeric algorithm with alg...
متن کاملAn Efficient Algorithm for the InCircle Predicate among Smooth Closed Curves
This paper concentrates on the InCircle predicate which is used for the computation of the Voronoi diagram of smooth closed curves. The predicate decides the position of a query object relative to the Voronoi circle of three given ones. We focus on (nonintersecting) ellipses but our method extends to arbitrary closed smooth curves, given in parametric representation. We describe an efficient al...
متن کاملACS Algorithms for Complex Shapes with Certified Numerics and Topology Voronoi diagram of ellipses: cgal-based implementation
We present a C++ open-source implementation of an incremental algorithm for the computation of the Voronoi diagram of ellipses in the Euclidean plane. This is the first complete implementation, under the exact computation paradigm; it also computes the approximate diagram with any given precision. It is based on the cgal package for the Apollonius diagram. The ellipses are given in parametric r...
متن کاملAnalysis of the Incircle predicate for the Euclidean Voronoi diagram of axes-aligned line segments
In this paper we study the most-demanding predicate for computing the Euclidean Voronoi diagram of axes-aligned line segments, namely the Incircle predicate. Our contribution is twofold: firstly, we describe, in algorithmic terms, how to compute the Incircle predicate for axesaligned line segments, and secondly we compute its algebraic degree. Our primary aim is to minimize the algebraic degree...
متن کاملExact Voronoi diagram of smooth convex pseudo-circles: General predicates, and implementation for ellipses
We examine the problem of computing exactly the Voronoi diagram (via the dual Delaunay graph) of a set of, possibly intersecting, smooth convex pseudocircles in the Euclidean plane, given in parametric form. Pseudo-circles are (convex) sites, every pair of which has at most two intersecting points. The Voronoi diagram is constructed incrementally. Our first contribution is to propose robust and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006